Heuristic methods for evolutionary computation techniques
نویسندگان
چکیده
منابع مشابه
Heuristic methods for evolutionary computation techniques
Evolutionary computation techniques, which are based on a powerful principle of evolution: survival of the ttest, constitute an interesting category of heuristic search. In other words, evolutionary techniques are stochastic algorithms whose search methods model some natural phenomena: genetic inheritance and Darwinian strife for survival. Any evolutionary algorithm applied to a particular prob...
متن کاملA Survey of Constraint Handling Techniques in Evolutionary Computation Methods
One of the major components of any evolutionary system is the evaluation function. Evaluation functions are used to assign a quality measure for individuals in a population. Whereas evolutionary computation techniques assume the existence of an (e cient) evaluation function for feasible individuals, there is no uniform methodology for handling (i.e., evaluating) unfeasible ones. The simplest ap...
متن کاملNetwork Planning Using Iterative Improvement Methods and Heuristic Techniques
The problem of minimum-cost expansion of power transmission network is formulated as a genetic algorithm with the cost of new lines and security constraints and Kirchhoff’s Law at each bus bar included. A genetic algorithm (GA) is a search or optimization algorithm based on the mechanics of natural selection and genetics. An applied example is presented. The results from a set of tests carried ...
متن کاملMulti-Objective Optimization using Evolutionary Computation Techniques
In this paper an EP and PSO based optimization algorithms have been proposed for solving optimal power flow problems with multiple objective functions. These algorithms take into consideration all the equality and inequality constraints. The improvement in system performance is based on reduction in cost of power generation and active power loss. The
متن کاملCryptanalysis of SDES via evolutionary computation techniques
The cryptanalysis of simplified data encryption standard can be formulated as NP-Hard combinatorial problem. The goal of this paper is two fold. First we want to make a study about how evolutionary computation techniques can efficiently solve the NP-Hard combinatorial problem. For achieving this goal we test several evolutionary computation techniques like memetic algorithm, genetic algorithm a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Heuristics
سال: 1996
ISSN: 1381-1231,1572-9397
DOI: 10.1007/bf00127077